Constructing infinitely many half-arc-transitive covers of tetravalent graphs

We prove that, given a finite graph ? satisfying some mild conditions, there exist infinitely many tetravalent half-arc-transitive normal covers of ?. Applying this result, we establish the existence infinite families graphs with certain vertex stabilizers, and classify stabilizers up to order 28 connected graphs. This sheds new light on longstanding problem classifying